Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach

نویسندگان

  • Jaewook Kim
  • Yun Peng
  • Nenad Ivezic
  • Junho Shin
چکیده

We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of pathto-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartite graph matching problems with different constraints, which are solved by different mathematical programming techniques, including integer programming and dynamic programming. Solutions to simpler problems provide weights for the next stage until the optimal tree-to-tree matching solution is obtained. The effectiveness of this approach has been verified and demonstrated by computer experiments. Keywords-E-business; XML schema matching; optimization; maximum-weighted bipartite graph; semantic similarity; integer programming; dynamic programming

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

Defining the XML Schema Matching Problem for a Personal Schema Based Query Answering System

3 A framework for defining a schema matching problem 6 3.1 Modeling XML schemas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.1 Features of the XML schema language . . . . . . . . . . . . . . . . . . . . . 7 3.1.2 Graph theory basics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.3 XML schema graph . . . . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

Management of Xml Data by Means of Schema Matching

The eXtensible Markup Language (XML) has emerged as a de facto standard to represent and exchange information among various applications on the Web and within organizations due to XML’s inherent data self-describing capability and flexibility of organizing data. As a result, the number of available (heterogeneous) XML data is rapidly increasing, and the need for developing high-performance tech...

متن کامل

A novel method for measuring semantic similarity for XML schema matching

Enterprises integration has recently gained great attentions, as never before. The paper deals with an essential activity enabling seamless enterprises integration, that is, a similarity-based schema matching. To this end, we present a supervised approach to measure semantic similarity between XML schema documents, and, more importantly, address a novel approach to augment reliably labeled trai...

متن کامل

Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem

The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema matching . Semantic schema matching has been extensively researched, and many matching systems have been developed. However, formal specifications of problems being solved by th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010